Maximum flow under proportional delay constraint
نویسندگان
چکیده
منابع مشابه
Maximum flow under proportional delay constraint
Given a network and a set of source destination pairs (connections), we consider the problem of maximizing the sum of the flow under proportional delay constraints. In this paper, the delay for crossing a link is proportional to the total flow crossing this link. If a connection supports non-zero flow, then the sum of the delay along any path corresponding to that connection must be lower than ...
متن کاملMinimizing Average Flow-Time under Knapsack Constraint
We give the first logarithmic approximation for minimizing average flow-time of jobs in the subset parallel machine setting (also called the restricted assignment setting) under a single knapsack constraint. In a knapsack constraint setting, each job has a profit, and the set of jobs which get scheduled must have a total profit of at least a quantity Π. Our result extends the work of Gupta, Kri...
متن کاملLevelwise Cluster Mining under a Maximum SSE Constraint
In this work we cast the problem of finding clusters in the dataset into a frequent itemset mining problem. We show that the SSE measures is monotone with respect to set inclusion, and use this property in an Apriori style algorithm to find optimal clusters in the data. Some preliminary experiments are reported on real life data.
متن کاملMaximum likelihood multichannel estimation under reduced rank constraint
This paper deals with the maximum likelihood estimation of the multichannel impulse response in a mobile communication system whose base stations are equipped with antennas arrays. The following problem is solved: using the training sequence, find the maximum likelihood multichannel impulse response from one mobile to the base station under a reduced rank constraint in the presence of gaussian ...
متن کاملInteger Maximum Flow in Wireless Sensor Networks with Energy Constraint
We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes gather data and then relay them to a base station, before they run out of battery power. Packets are considered as integral units and not splittable. The problem is to find the maximum data flow in the sensor network subject to the energy constraint of the sensors. We show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.05.034